Efficient preflow push algorithms

Algorithms for the maximum flow problem can be grouped into two categories: augmenting path algorithms [9], and preflow push algorithms [11]. Preflow push algorithms are characterized by a drawback known as ping pong effect. In this paper we present a technique that allows to avoid such an effect and can be considered as an approach combining the augmenting path and preflow push methods. An extended experimentation shows the effectiveness of the proposed approach.